A-T-LAS2,1: A Multi-Penalty Approach to Compressed Sensing of Low-Rank Matrices with Sparse Decompositions∗

نویسندگان

  • Massimo Fornasier
  • Johannes Maly
  • Valeriya Naumova
چکیده

Compressed Sensing is about recovering an unknown vector of dimension n from m n linear measurements. This task becomes possible, for instance, when few entries of the vector have large magnitude and, hence, the vector is essentially of low intrinsic dimension. If one wishes to recover an n1 × n2 matrix instead, low-rankness can be added as sparsity structure of low intrinsic dimensionality. For this purpose we propose a novel algorithm, which we call Alternating Tikhonov regularization and Lasso (A-T-LAS2,1). It is based on a multi-penalty regularization for recovery of low-rank matrices with approximately sparse singular vectors, which is able to leverage both structures (low-rankness and sparsity) simultaneously and effectively reduce further the number of necessary measurements with respect to the sole use of one of the two sparsity structures. We provide local recovery guarantees of A-T-LAS2,1. The analysis is surprisingly relatively simple, e.g., compared to the one of other similar approaches such as Sparse Power Factorization (SPF). It relies on an adaptation of restricted isometry property to low-rank and approximately sparse matrices, LASSO technique, and results on proximal alternating minimization. We show that A-T-LAS2,1 exhibits similar performance to the state of the art method SPF, outperforming it in strong noise regimes and for matrices whose singular vectors do not possess exact (joint-) sparse support.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersecting singularities for multi-structured estimation

We address the problem of designing a convex nonsmooth regularizer encouraging multiple structural effects simultaneously. Focusing on the inference of sparse and low-rank matrices we suggest a new complexity index and a convex penalty approximating it. The new penalty term can be written as the trace norm of a linear function of the matrix. By analyzing theoretical properties of this family of...

متن کامل

Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices

In this paper we consider recovery of a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model which can efficiently restricts the degrees of freedom of data and, at the same time, is generic so that finds varieties of applications, namely, in multichannel signal compressed sensing (e.g. sensor networks, hyperspectral imaging) and compressi...

متن کامل

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

Soft Recovery Through ℓ1, 2 Minimization with Applications in Recovery of Simultaneously Sparse and Low-Rank Matrice

This article provides a new type of analysis of a compressed-sensing based technique for recovering columnsparse matrices, namely minimization of the l1,2-norm. Rather than providing conditions on the measurement matrix which guarantees the solution of the program to be exactly equal to the ground truth signal (which already has been thoroughly investigated), it presents a condition which guara...

متن کامل

Tensor completion in hierarchical tensor representations

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the reconstruction of tensors of low multi-linear rank in recently introduced hierarchical tensor formats from a small number of measurements. Hierarchical tensors are a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018